package psn.zjk.common.mq.rabbitmq;

import java.util.concurrent.*;

public class X {

    public static void main(String[] args) {
        int[] x = null;
        int z = x[0];
        //选取第一个元素为基准值
        //递归开始：

        for (int i = 0; i < x.length; i++) {
            z = x[i];
            //从后往前比较，遇到比自己小的则互换
            for (int j = x.length - 1; j < x.length - 1; j--) {
                if (z < x[j]) {

                }
            }
            //从前往后比较，遇到比自己大的则互换
        }
    }


    public void x() throws InterruptedException, TimeoutException, BrokenBarrierException {
        CountDownLatch countDownLatch = new CountDownLatch(11);
        countDownLatch.countDown();
        CyclicBarrier cyclicBarrier = new CyclicBarrier(11);
        cyclicBarrier.await(1, TimeUnit.DAYS);
        Semaphore semaphore = new Semaphore(11);
        semaphore.acquire();
        new ThreadPoolExecutor(1, 2, 3, TimeUnit.MICROSECONDS, new ArrayBlockingQueue<>(10));
    }

}